Fully Incremental LCS Computation
نویسندگان
چکیده
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similarities between biological sequences. A common scheme for sequence comparison is the longest common subsequence (LCS ) metric. This paper considers the fully incremental LCS computation problem as follows: For any strings A,B and characters a, b, compute LCS(aA,B), LCS(A, bB), LCS(Aa,B), and LCS(A,Bb), provided that L = LCS(A,B) is already computed. We present an efficient algorithm that computes the four LCS values above, in O(L) or O(n) time depending on where a new character is added, where n is the length of A. Our algorithm is superior in both time and space complexities to the previous known methods.
منابع مشابه
A surface tracking fast algorithm for computing Lagrangian coherent structures in 3D unsteady flows
A surface tracking algorithm is developed for the computation and extraction of Lagrangian coherent structures (LCS) in 3D unsteady flows. An advancing front algorithm is used to approximate the LCS surface with a mesh of triangles at each time step. Computations are performed only along the ridges in the finite time Lyapunov exponent (FTLE) field, which identify LCS. Initial results appear ver...
متن کاملOptimizations for the Role-Depth Bounded Least Common Subsumer in EL+
Computing the least common subsumer (lcs) yields a generalization of a collection of concepts, computing such generalizations is a useful reasoning task for many ontology-based applications. Since the lcs need not exist, if computed w.r.t. general TBoxes, an approximative approach, the role-depth bounded lcs, has been proposed. Recently, this approach has been extended to the Description logic ...
متن کاملAn Input Sensitive Online Algorithm for LCS Computation
We consider the classic problem of computing (the length of) the longest common subsequence (LCS) between two strings A and B with lengths m and n, respectively. There are several input sensitive algorithms for this problem, such as the O(σn+min{Lm,L(n−L)}) algorithms by Rick [15] and Goeman and Clausen [5] and the O(σn + min{σd, Lm}) algorithms by Chin and Poon [4] and Rick [15]. Here L is the...
متن کاملFormalized analysis of structural characteristics of large complex systems
Macrostructural modelization is paramount to the development of large complex systems (LCS). However, effective methodology has not been well established for macrostructural modelization of LCS. This paper explores the macrostructural modelization of LCS in terms of block diagram based model and grammar based model. Firstly, the macrostructural modelization problem of LCS is formulated. Secondl...
متن کاملComputing the lcs w.r.t. General EL+-TBoxes
Recently, exact conditions for the existence of the least common subsumer (lcs) computed w.r.t. general EL-TBoxes have been devised [13]. This paper extends these results and provides necessary and suffcient conditions for the existence of the lcs w.r.t. EL-TBoxes. We show decidability of the existence in PTime and polynomial bounds on the maximal role-depth of the lcs, which in turn yields a c...
متن کامل